A New Belief-Based Incomplete Pattern Unsupervised Classification Method

نویسندگان

چکیده

The clustering of incomplete patterns is a very challenging task because the estimations may negatively affect distribution real centers and thus cause uncertainty imprecision in results. To address this problem, new belief-based pattern unsupervised classification method (BPC) proposed paper. First, complete are grouped into few clusters by classical soft like fuzzy $c$ -means to obtain corresponding reliable thereby partitioned unreliable ones an optimization method. Second, basic classifier trained employed classifies edited neighbors. In way, most can be submitted specific clusters. Finally, some ambiguous will carefully repartitioned again distance-based rule depending on obtained belief functions theory. By doing this, that difficult classify between different reasonably meta-cluster which characterize due missing values. simulation results show BPC has potential deal with datasets.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new belief-based K-nearest neighbor classification method

The K-nearest neighbor (K-NN) classification method originally developed in the probabilistic framework has serious difficulties to classify correctly the close data points (objects) originating from different classes. To cope with such difficult problem and make the classification result more robust to misclassification errors, we propose a new belief-based K-nearest neighbor (BK-NN) method th...

متن کامل

A Mirroring Theorem and its Application to a New Method of Unsupervised Hierarchical Pattern Classification

In this paper, we prove a crucial theorem called “Mirroring Theorem” which affirms that given a collection of samples with enough information in it such that it can be classified into classes and sub-classes then (i) There exists a mapping which classifies and subclassifies these samples (ii) There exists a hierarchical classifier which can be constructed by using Mirroring Neural Networks (MNN...

متن کامل

Temporal Pattern Generation Using Hidden Markov Model Based Unsupervised Classification

This paper describes a clustering methodology for temporal data using hidden Markov model(HMM) representation. The proposed method improves upon existing HMM based clustering methods in two ways: (i) it enables HMMs to dynamically change its model structure to obtain a better t model for data during clustering process, and (ii) it provides objective criterion function to automatically select th...

متن کامل

A new classification method based on pairwise SVM for facial age estimation

This paper presents a practical algorithm for facial age estimation from frontal face image. Facial age estimation generally comprises two key steps including age image representation and age estimation. The anthropometric model used in this study includes computation of eighteen craniofacial ratios and a new accurate skin wrinkles analysis in the first step and a pairwise binary support vector...

متن کامل

A New Document Embedding Method for News Classification

Abstract- Text classification is one of the main tasks of natural language processing (NLP). In this task, documents are classified into pre-defined categories. There is lots of news spreading on the web. A text classifier can categorize news automatically and this facilitates and accelerates access to the news. The first step in text classification is to represent documents in a suitable way t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Knowledge and Data Engineering

سال: 2022

ISSN: ['1558-2191', '1041-4347', '2326-3865']

DOI: https://doi.org/10.1109/tkde.2021.3049511